Analyzing Availability of Replicated Database Systems

Regeneration-based Multiversion Dynamic Voting Scheme for Replicated Database Systems. in 6th Ieee Conference On

A pessimistic consistency control algorithm for replicated les which achieves high availability. of replicated objects: A technique and its eden A majority consensus approach to concurrency control for multiple copy databases.

The Design and Simulation of a Hybrid Replication Control Protocol

Replica control protocols in distributed database systems are responsible for the management and maintenance of replicated (redundant) data. Maintaining replicated data improves performance and increases availability. Keeping the replicated data consistent and available during the presence of failures can however become quite di cult. This paper presents the design of a hybrid replica control p...

Concurrency vs. availability : atomicity mechanisms for replicated data

User-Perceived Availability and Response-Time in Voting-Based Replicated Systems: A Case Study

In this paper, we develop a modeling method based on stochastic Petri nets (SPN) to allow user-perceived measures in voting-based replicated systems to be estimated. The merit of our approach is that user-arrival, maintenance, and node/link-failure or -repair processes are fully decoupled, thus allowing us to remove some unnecessary modeling assumptions and also to keep track of states in which...

Analyzing Recon gurable Algorithms for Managing Replicated Data with Strict Consistency Requirements: A Case Study

In this paper, we address recon gurable algorithms for managing replicated data with strict consistency requirements, that is, whenever the user performs an update operation, the update is applied to all reachable copies as part of the update protocol. A key issue of designing such algorithms is to determine how often one should detect and react to failure conditions so that reorganization oper...